An Elliptic Curve Threshold Group Signature Scheme
نویسندگان
چکیده
منابع مشابه
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملCryptanalysis of A Self-Certified Threshold Proxy Signature Scheme Ased on Elliptic Curve Discrete Logarithm Problem
Digital signatures based on self-certified public key systems are more efficient because the authentication of the users’ public keys can be implicitly accomplished with the signature verification. In 2009, Xue et al. proposed first self-certified threshold proxy signature scheme based on the elliptic curve discrete logarithm problem (ECDLP). In this paper, we show that Xue et al.’s scheme can ...
متن کاملRepairing Efficient Threshold Group Signature Scheme
To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the proposed scheme can use short secret key and reduces the load of signature verification. However, in this paper we find that there are many ambiguities in the proposed scheme. The verifiers cannot verify valid signatures, wh...
متن کاملAn Efficient Identity-Based Group Signature Scheme over Elliptic Curves
Considering such a scenario: Several network policemen consist of a group NP in a network; Every one of them can find out what kind of documents are harmful and then sign them. Any user in this network who receives the above documents would check whether a signature exists on the documents and also it is validly signed by the group NP. And then, this user can be convinced the document is really...
متن کاملID-Based Signature Scheme Using Elliptic Curve Cryptosystem
Chung, Huang, Lai and Chen proposed an ID-based signature scheme on the elliptic curve cryptosystem. Their scheme is secure but requires 60.12 1 for signature generation and 87.24 1 for signature verification. In this article, we propose an improvement of their signature scheme with three results: The improved scheme reduces about 50% and 33% of time complexity respectively for both signature g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Conference on Aerospace Sciences and Aviation Technology
سال: 2013
ISSN: 2090-0678
DOI: 10.21608/asat.2013.22082